./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.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 13f0d023cf70be0ab2bade1c9c2a45b94596f842e278edf3cfbd034e77d4c50c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:37:29,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:37:29,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:37:29,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:37:29,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:37:29,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:37:29,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:37:29,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:37:29,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:37:29,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:37:29,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:37:29,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:37:29,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:37:29,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:37:29,372 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:37:29,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:37:29,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:37:29,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:37:29,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:37:29,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:37:29,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:37:29,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:37:29,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:37:29,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:37:29,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:37:29,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:37:29,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:37:29,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:37:29,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:37:29,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:37:29,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:37:29,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:37:29,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:37:29,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:37:29,374 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 -> 13f0d023cf70be0ab2bade1c9c2a45b94596f842e278edf3cfbd034e77d4c50c [2025-02-05 21:37:29,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:37:29,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:37:29,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:37:29,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:37:29,635 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:37:29,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i [2025-02-05 21:37:30,773 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9932dd431/934f08d7b5fd45d0bc5664b38a34014e/FLAGf597900f6 [2025-02-05 21:37:31,073 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:37:31,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i [2025-02-05 21:37:31,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9932dd431/934f08d7b5fd45d0bc5664b38a34014e/FLAGf597900f6 [2025-02-05 21:37:31,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9932dd431/934f08d7b5fd45d0bc5664b38a34014e [2025-02-05 21:37:31,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:37:31,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:37:31,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:37:31,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:37:31,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:37:31,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35249644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31, skipping insertion in model container [2025-02-05 21:37:31,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:37:31,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i[916,929] [2025-02-05 21:37:31,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:37:31,338 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:37:31,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i[916,929] [2025-02-05 21:37:31,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:37:31,410 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:37:31,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31 WrapperNode [2025-02-05 21:37:31,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:37:31,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:37:31,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:37:31,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:37:31,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,456 INFO L138 Inliner]: procedures = 26, calls = 72, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2025-02-05 21:37:31,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:37:31,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:37:31,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:37:31,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:37:31,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,484 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:37:31,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:37:31,507 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:37:31,507 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:37:31,507 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:37:31,508 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (1/1) ... [2025-02-05 21:37:31,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:37:31,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:31,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:37:31,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:37:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:37:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:37:31,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:37:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:37:31,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:37:31,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:37:31,660 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:37:31,662 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:37:32,257 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 21:37:32,257 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:37:32,271 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:37:32,271 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-05 21:37:32,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:37:32 BoogieIcfgContainer [2025-02-05 21:37:32,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:37:32,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:37:32,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:37:32,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:37:32,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:37:31" (1/3) ... [2025-02-05 21:37:32,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5948c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:37:32, skipping insertion in model container [2025-02-05 21:37:32,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:31" (2/3) ... [2025-02-05 21:37:32,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5948c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:37:32, skipping insertion in model container [2025-02-05 21:37:32,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:37:32" (3/3) ... [2025-02-05 21:37:32,278 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-59.i [2025-02-05 21:37:32,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:37:32,288 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-59.i that has 2 procedures, 194 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:37:32,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:37:32,328 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;@7eff336, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:37:32,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:37:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 132 states have (on average 1.553030303030303) internal successors, (205), 133 states have internal predecessors, (205), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-05 21:37:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-05 21:37:32,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:32,345 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:32,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:32,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash -242777663, now seen corresponding path program 1 times [2025-02-05 21:37:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:32,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583641371] [2025-02-05 21:37:32,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:32,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:32,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 21:37:32,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 21:37:32,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:32,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2025-02-05 21:37:32,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583641371] [2025-02-05 21:37:32,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583641371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:37:32,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835367509] [2025-02-05 21:37:32,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:32,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:32,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:32,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:37:32,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:37:32,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 21:37:32,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 21:37:32,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:32,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:32,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:37:32,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:37:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2025-02-05 21:37:33,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:37:33,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835367509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:33,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:37:33,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:37:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431041509] [2025-02-05 21:37:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:33,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:37:33,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:33,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:37:33,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:37:33,032 INFO L87 Difference]: Start difference. First operand has 194 states, 132 states have (on average 1.553030303030303) internal successors, (205), 133 states have internal predecessors, (205), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:37:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:33,086 INFO L93 Difference]: Finished difference Result 382 states and 700 transitions. [2025-02-05 21:37:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:37:33,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) Word has length 381 [2025-02-05 21:37:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:33,094 INFO L225 Difference]: With dead ends: 382 [2025-02-05 21:37:33,096 INFO L226 Difference]: Without dead ends: 191 [2025-02-05 21:37:33,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:37:33,101 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:33,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-05 21:37:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-02-05 21:37:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 130 states have (on average 1.5307692307692307) internal successors, (199), 130 states have internal predecessors, (199), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-05 21:37:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 317 transitions. [2025-02-05 21:37:33,141 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 317 transitions. Word has length 381 [2025-02-05 21:37:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:33,141 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 317 transitions. [2025-02-05 21:37:33,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:37:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 317 transitions. [2025-02-05 21:37:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-05 21:37:33,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:33,173 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:33,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:37:33,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:37:33,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:33,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash -502614042, now seen corresponding path program 1 times [2025-02-05 21:37:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:33,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080909073] [2025-02-05 21:37:33,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:33,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 21:37:33,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 21:37:33,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:33,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:34,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080909073] [2025-02-05 21:37:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080909073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:37:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372455138] [2025-02-05 21:37:34,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:34,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:37:34,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:34,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:37:34,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:37:34,188 INFO L87 Difference]: Start difference. First operand 191 states and 317 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:34,463 INFO L93 Difference]: Finished difference Result 568 states and 946 transitions. [2025-02-05 21:37:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:37:34,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 381 [2025-02-05 21:37:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:34,468 INFO L225 Difference]: With dead ends: 568 [2025-02-05 21:37:34,468 INFO L226 Difference]: Without dead ends: 380 [2025-02-05 21:37:34,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:34,469 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 298 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:34,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 917 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:37:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-05 21:37:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 361. [2025-02-05 21:37:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 240 states have (on average 1.5291666666666666) internal successors, (367), 240 states have internal predecessors, (367), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-05 21:37:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2025-02-05 21:37:34,524 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 381 [2025-02-05 21:37:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:34,525 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 603 transitions. [2025-02-05 21:37:34,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions. [2025-02-05 21:37:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-05 21:37:34,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:34,530 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:34,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:37:34,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:34,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1615736225, now seen corresponding path program 1 times [2025-02-05 21:37:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:34,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907951658] [2025-02-05 21:37:34,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:34,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-05 21:37:34,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-05 21:37:34,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:34,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:34,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907951658] [2025-02-05 21:37:34,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907951658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:34,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:34,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:37:34,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199065653] [2025-02-05 21:37:34,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:34,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:37:34,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:34,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:37:34,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:34,888 INFO L87 Difference]: Start difference. First operand 361 states and 603 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:35,126 INFO L93 Difference]: Finished difference Result 887 states and 1504 transitions. [2025-02-05 21:37:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:37:35,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 382 [2025-02-05 21:37:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:35,131 INFO L225 Difference]: With dead ends: 887 [2025-02-05 21:37:35,131 INFO L226 Difference]: Without dead ends: 695 [2025-02-05 21:37:35,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:35,132 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 444 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:35,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 940 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:37:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-02-05 21:37:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 634. [2025-02-05 21:37:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 497 states have (on average 1.663983903420523) internal successors, (827), 498 states have internal predecessors, (827), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-05 21:37:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1091 transitions. [2025-02-05 21:37:35,186 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1091 transitions. Word has length 382 [2025-02-05 21:37:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:35,187 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 1091 transitions. [2025-02-05 21:37:35,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1091 transitions. [2025-02-05 21:37:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-05 21:37:35,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:35,192 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:35,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:37:35,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:35,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2126270402, now seen corresponding path program 1 times [2025-02-05 21:37:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:35,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331109752] [2025-02-05 21:37:35,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:35,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-05 21:37:35,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-05 21:37:35,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:35,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:35,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331109752] [2025-02-05 21:37:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331109752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:35,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:37:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377552196] [2025-02-05 21:37:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:35,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:37:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:35,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:37:35,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:35,646 INFO L87 Difference]: Start difference. First operand 634 states and 1091 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:37:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:36,091 INFO L93 Difference]: Finished difference Result 1426 states and 2453 transitions. [2025-02-05 21:37:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:37:36,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 382 [2025-02-05 21:37:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:36,098 INFO L225 Difference]: With dead ends: 1426 [2025-02-05 21:37:36,098 INFO L226 Difference]: Without dead ends: 1076 [2025-02-05 21:37:36,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:36,100 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 549 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:36,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 758 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:37:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-02-05 21:37:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 784. [2025-02-05 21:37:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 647 states have (on average 1.714064914992272) internal successors, (1109), 648 states have internal predecessors, (1109), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-05 21:37:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1373 transitions. [2025-02-05 21:37:36,158 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1373 transitions. Word has length 382 [2025-02-05 21:37:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1373 transitions. [2025-02-05 21:37:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:37:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1373 transitions. [2025-02-05 21:37:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-05 21:37:36,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:36,163 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:36,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:37:36,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1990404060, now seen corresponding path program 1 times [2025-02-05 21:37:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800299198] [2025-02-05 21:37:36,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:36,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:36,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-05 21:37:36,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-05 21:37:36,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:36,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:36,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:36,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800299198] [2025-02-05 21:37:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800299198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:36,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:36,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428990264] [2025-02-05 21:37:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:36,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:36,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:36,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:36,313 INFO L87 Difference]: Start difference. First operand 784 states and 1373 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:36,401 INFO L93 Difference]: Finished difference Result 1942 states and 3443 transitions. [2025-02-05 21:37:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:36,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 382 [2025-02-05 21:37:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:36,408 INFO L225 Difference]: With dead ends: 1942 [2025-02-05 21:37:36,409 INFO L226 Difference]: Without dead ends: 1372 [2025-02-05 21:37:36,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:36,411 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 196 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:36,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 686 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-02-05 21:37:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1369. [2025-02-05 21:37:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1187 states have (on average 1.709351305812974) internal successors, (2029), 1190 states have internal predecessors, (2029), 174 states have call successors, (174), 7 states have call predecessors, (174), 7 states have return successors, (174), 171 states have call predecessors, (174), 174 states have call successors, (174) [2025-02-05 21:37:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2377 transitions. [2025-02-05 21:37:36,490 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2377 transitions. Word has length 382 [2025-02-05 21:37:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:36,491 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2377 transitions. [2025-02-05 21:37:36,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2377 transitions. [2025-02-05 21:37:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-05 21:37:36,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:36,495 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:36,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:37:36,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:36,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2103098971, now seen corresponding path program 1 times [2025-02-05 21:37:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:36,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047585657] [2025-02-05 21:37:36,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:36,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-05 21:37:36,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-05 21:37:36,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:36,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:36,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047585657] [2025-02-05 21:37:36,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047585657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:36,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:36,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:37:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809205751] [2025-02-05 21:37:36,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:36,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:37:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:36,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:37:36,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:37:36,858 INFO L87 Difference]: Start difference. First operand 1369 states and 2377 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:37,288 INFO L93 Difference]: Finished difference Result 3820 states and 6633 transitions. [2025-02-05 21:37:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:37:37,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 382 [2025-02-05 21:37:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:37,299 INFO L225 Difference]: With dead ends: 3820 [2025-02-05 21:37:37,299 INFO L226 Difference]: Without dead ends: 2677 [2025-02-05 21:37:37,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:37:37,303 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 361 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:37,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 798 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:37:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2025-02-05 21:37:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2205. [2025-02-05 21:37:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1958 states have (on average 1.713993871297242) internal successors, (3356), 1965 states have internal predecessors, (3356), 234 states have call successors, (234), 12 states have call predecessors, (234), 12 states have return successors, (234), 227 states have call predecessors, (234), 234 states have call successors, (234) [2025-02-05 21:37:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3824 transitions. [2025-02-05 21:37:37,402 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3824 transitions. Word has length 382 [2025-02-05 21:37:37,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:37,403 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 3824 transitions. [2025-02-05 21:37:37,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3824 transitions. [2025-02-05 21:37:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-02-05 21:37:37,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:37,408 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:37,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:37:37,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:37,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash 623745293, now seen corresponding path program 1 times [2025-02-05 21:37:37,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:37,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336099249] [2025-02-05 21:37:37,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:37,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-05 21:37:37,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-05 21:37:37,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:37,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:37,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:37,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336099249] [2025-02-05 21:37:37,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336099249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:37,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:37,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:37:37,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599300432] [2025-02-05 21:37:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:37,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:37:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:37,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:37:37,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:37:37,742 INFO L87 Difference]: Start difference. First operand 2205 states and 3824 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:38,067 INFO L93 Difference]: Finished difference Result 4807 states and 8267 transitions. [2025-02-05 21:37:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:37:38,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 383 [2025-02-05 21:37:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:38,082 INFO L225 Difference]: With dead ends: 4807 [2025-02-05 21:37:38,083 INFO L226 Difference]: Without dead ends: 3539 [2025-02-05 21:37:38,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:38,088 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 312 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:38,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 915 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:37:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2025-02-05 21:37:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3471. [2025-02-05 21:37:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3471 states, 3041 states have (on average 1.6987832949687602) internal successors, (5166), 3055 states have internal predecessors, (5166), 409 states have call successors, (409), 20 states have call predecessors, (409), 20 states have return successors, (409), 395 states have call predecessors, (409), 409 states have call successors, (409) [2025-02-05 21:37:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 5984 transitions. [2025-02-05 21:37:38,278 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 5984 transitions. Word has length 383 [2025-02-05 21:37:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:38,279 INFO L471 AbstractCegarLoop]: Abstraction has 3471 states and 5984 transitions. [2025-02-05 21:37:38,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 5984 transitions. [2025-02-05 21:37:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-05 21:37:38,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:38,284 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:38,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:37:38,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:38,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 629829080, now seen corresponding path program 1 times [2025-02-05 21:37:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403470669] [2025-02-05 21:37:38,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:38,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-05 21:37:38,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-05 21:37:38,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:38,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:38,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:38,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403470669] [2025-02-05 21:37:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403470669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:38,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:37:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894787414] [2025-02-05 21:37:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:38,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:37:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:38,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:37:38,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:37:38,952 INFO L87 Difference]: Start difference. First operand 3471 states and 5984 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:39,870 INFO L93 Difference]: Finished difference Result 11351 states and 19469 transitions. [2025-02-05 21:37:39,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:37:39,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 384 [2025-02-05 21:37:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:39,917 INFO L225 Difference]: With dead ends: 11351 [2025-02-05 21:37:39,917 INFO L226 Difference]: Without dead ends: 8707 [2025-02-05 21:37:39,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:37:39,926 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 489 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:39,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 947 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:37:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8707 states. [2025-02-05 21:37:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8707 to 7585. [2025-02-05 21:37:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7585 states, 6784 states have (on average 1.713443396226415) internal successors, (11624), 6812 states have internal predecessors, (11624), 759 states have call successors, (759), 41 states have call predecessors, (759), 41 states have return successors, (759), 731 states have call predecessors, (759), 759 states have call successors, (759) [2025-02-05 21:37:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7585 states to 7585 states and 13142 transitions. [2025-02-05 21:37:40,310 INFO L78 Accepts]: Start accepts. Automaton has 7585 states and 13142 transitions. Word has length 384 [2025-02-05 21:37:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:40,311 INFO L471 AbstractCegarLoop]: Abstraction has 7585 states and 13142 transitions. [2025-02-05 21:37:40,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 7585 states and 13142 transitions. [2025-02-05 21:37:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-05 21:37:40,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:40,317 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:40,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:37:40,318 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:40,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash 641145207, now seen corresponding path program 1 times [2025-02-05 21:37:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674403915] [2025-02-05 21:37:40,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:40,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-05 21:37:40,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-05 21:37:40,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:40,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674403915] [2025-02-05 21:37:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674403915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:41,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:37:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719247863] [2025-02-05 21:37:41,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:41,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:37:41,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:41,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:37:41,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:37:41,139 INFO L87 Difference]: Start difference. First operand 7585 states and 13142 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:42,164 INFO L93 Difference]: Finished difference Result 19430 states and 33686 transitions. [2025-02-05 21:37:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:37:42,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 384 [2025-02-05 21:37:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:42,236 INFO L225 Difference]: With dead ends: 19430 [2025-02-05 21:37:42,237 INFO L226 Difference]: Without dead ends: 13182 [2025-02-05 21:37:42,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:37:42,253 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 484 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:42,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1706 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:37:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13182 states. [2025-02-05 21:37:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13182 to 11809. [2025-02-05 21:37:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11809 states, 10638 states have (on average 1.7145140063921789) internal successors, (18239), 10680 states have internal predecessors, (18239), 1109 states have call successors, (1109), 61 states have call predecessors, (1109), 61 states have return successors, (1109), 1067 states have call predecessors, (1109), 1109 states have call successors, (1109) [2025-02-05 21:37:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11809 states to 11809 states and 20457 transitions. [2025-02-05 21:37:42,866 INFO L78 Accepts]: Start accepts. Automaton has 11809 states and 20457 transitions. Word has length 384 [2025-02-05 21:37:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:42,866 INFO L471 AbstractCegarLoop]: Abstraction has 11809 states and 20457 transitions. [2025-02-05 21:37:42,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 11809 states and 20457 transitions. [2025-02-05 21:37:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-05 21:37:42,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:42,876 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:42,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:37:42,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:42,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:42,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1693565975, now seen corresponding path program 1 times [2025-02-05 21:37:42,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:42,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935086601] [2025-02-05 21:37:42,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:42,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:42,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-05 21:37:42,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-05 21:37:42,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:42,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:43,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:43,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935086601] [2025-02-05 21:37:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935086601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:43,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:43,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:37:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085353758] [2025-02-05 21:37:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:43,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:37:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:43,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:37:43,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:37:43,288 INFO L87 Difference]: Start difference. First operand 11809 states and 20457 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:37:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:44,260 INFO L93 Difference]: Finished difference Result 24068 states and 41151 transitions. [2025-02-05 21:37:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:37:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 384 [2025-02-05 21:37:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:44,302 INFO L225 Difference]: With dead ends: 24068 [2025-02-05 21:37:44,302 INFO L226 Difference]: Without dead ends: 14648 [2025-02-05 21:37:44,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:37:44,325 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 707 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:44,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1036 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:37:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14648 states. [2025-02-05 21:37:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14648 to 11794. [2025-02-05 21:37:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11794 states, 10371 states have (on average 1.6828656831549513) internal successors, (17453), 10425 states have internal predecessors, (17453), 1325 states have call successors, (1325), 97 states have call predecessors, (1325), 97 states have return successors, (1325), 1271 states have call predecessors, (1325), 1325 states have call successors, (1325) [2025-02-05 21:37:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11794 states to 11794 states and 20103 transitions. [2025-02-05 21:37:44,857 INFO L78 Accepts]: Start accepts. Automaton has 11794 states and 20103 transitions. Word has length 384 [2025-02-05 21:37:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:44,859 INFO L471 AbstractCegarLoop]: Abstraction has 11794 states and 20103 transitions. [2025-02-05 21:37:44,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:37:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11794 states and 20103 transitions. [2025-02-05 21:37:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-05 21:37:44,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:44,866 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:44,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:37:44,867 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:44,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1558051903, now seen corresponding path program 1 times [2025-02-05 21:37:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:44,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615912102] [2025-02-05 21:37:44,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:44,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 21:37:44,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 21:37:44,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:44,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:45,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:45,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615912102] [2025-02-05 21:37:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615912102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:45,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:45,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:37:45,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561782547] [2025-02-05 21:37:45,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:45,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:37:45,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:45,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:37:45,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:37:45,572 INFO L87 Difference]: Start difference. First operand 11794 states and 20103 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:46,696 INFO L93 Difference]: Finished difference Result 19382 states and 32406 transitions. [2025-02-05 21:37:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:37:46,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 385 [2025-02-05 21:37:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:46,749 INFO L225 Difference]: With dead ends: 19382 [2025-02-05 21:37:46,750 INFO L226 Difference]: Without dead ends: 16642 [2025-02-05 21:37:46,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:37:46,764 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 456 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:46,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 967 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:37:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16642 states. [2025-02-05 21:37:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 12566. [2025-02-05 21:37:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12566 states, 11139 states have (on average 1.69045695304785) internal successors, (18830), 11193 states have internal predecessors, (18830), 1325 states have call successors, (1325), 101 states have call predecessors, (1325), 101 states have return successors, (1325), 1271 states have call predecessors, (1325), 1325 states have call successors, (1325) [2025-02-05 21:37:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12566 states to 12566 states and 21480 transitions. [2025-02-05 21:37:47,572 INFO L78 Accepts]: Start accepts. Automaton has 12566 states and 21480 transitions. Word has length 385 [2025-02-05 21:37:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:47,573 INFO L471 AbstractCegarLoop]: Abstraction has 12566 states and 21480 transitions. [2025-02-05 21:37:47,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 12566 states and 21480 transitions. [2025-02-05 21:37:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-05 21:37:47,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:47,580 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:47,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:37:47,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1546735776, now seen corresponding path program 1 times [2025-02-05 21:37:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:47,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897230959] [2025-02-05 21:37:47,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:47,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 21:37:47,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 21:37:47,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:47,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897230959] [2025-02-05 21:37:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897230959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:48,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:48,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:37:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29905783] [2025-02-05 21:37:48,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:48,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:37:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:48,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:37:48,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:37:48,217 INFO L87 Difference]: Start difference. First operand 12566 states and 21480 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:49,674 INFO L93 Difference]: Finished difference Result 46043 states and 79294 transitions. [2025-02-05 21:37:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:37:49,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 385 [2025-02-05 21:37:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:49,765 INFO L225 Difference]: With dead ends: 46043 [2025-02-05 21:37:49,766 INFO L226 Difference]: Without dead ends: 36375 [2025-02-05 21:37:49,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:37:49,793 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 807 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:49,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1219 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:37:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36375 states. [2025-02-05 21:37:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36375 to 21061. [2025-02-05 21:37:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21061 states, 18841 states have (on average 1.7000689984608035) internal successors, (32031), 18943 states have internal predecessors, (32031), 2069 states have call successors, (2069), 150 states have call predecessors, (2069), 150 states have return successors, (2069), 1967 states have call predecessors, (2069), 2069 states have call successors, (2069) [2025-02-05 21:37:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21061 states to 21061 states and 36169 transitions. [2025-02-05 21:37:50,794 INFO L78 Accepts]: Start accepts. Automaton has 21061 states and 36169 transitions. Word has length 385 [2025-02-05 21:37:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:50,795 INFO L471 AbstractCegarLoop]: Abstraction has 21061 states and 36169 transitions. [2025-02-05 21:37:50,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-05 21:37:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 21061 states and 36169 transitions. [2025-02-05 21:37:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-05 21:37:50,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:50,804 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:50,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:37:50,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:50,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash -193426079, now seen corresponding path program 1 times [2025-02-05 21:37:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439454552] [2025-02-05 21:37:50,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:50,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 21:37:50,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 21:37:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:37:51,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439454552] [2025-02-05 21:37:51,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439454552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:51,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:51,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:37:51,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713654156] [2025-02-05 21:37:51,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:51,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:37:51,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:51,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:37:51,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:51,260 INFO L87 Difference]: Start difference. First operand 21061 states and 36169 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:37:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:53,251 INFO L93 Difference]: Finished difference Result 50039 states and 85520 transitions. [2025-02-05 21:37:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:37:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 385 [2025-02-05 21:37:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:53,366 INFO L225 Difference]: With dead ends: 50039 [2025-02-05 21:37:53,366 INFO L226 Difference]: Without dead ends: 32600 [2025-02-05 21:37:53,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:53,403 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 584 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:53,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 845 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:37:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32600 states. [2025-02-05 21:37:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32600 to 22725. [2025-02-05 21:37:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22725 states, 20505 states have (on average 1.708510119483053) internal successors, (35033), 20607 states have internal predecessors, (35033), 2069 states have call successors, (2069), 150 states have call predecessors, (2069), 150 states have return successors, (2069), 1967 states have call predecessors, (2069), 2069 states have call successors, (2069) [2025-02-05 21:37:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 39171 transitions. [2025-02-05 21:37:54,456 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 39171 transitions. Word has length 385 [2025-02-05 21:37:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:54,457 INFO L471 AbstractCegarLoop]: Abstraction has 22725 states and 39171 transitions. [2025-02-05 21:37:54,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:37:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 39171 transitions. [2025-02-05 21:37:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-05 21:37:54,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:54,467 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:37:54,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:37:54,467 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:54,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1422662529, now seen corresponding path program 1 times [2025-02-05 21:37:54,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:54,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040466535] [2025-02-05 21:37:54,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:54,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 21:37:54,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 21:37:54,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:54,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 51 proven. 123 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-02-05 21:37:55,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:55,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040466535] [2025-02-05 21:37:55,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040466535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:37:55,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283355346] [2025-02-05 21:37:55,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:55,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:55,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:55,184 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 21:37:55,187 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 21:37:55,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 21:37:55,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 21:37:55,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:55,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:55,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:37:55,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:37:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3499 proven. 21 refuted. 0 times theorem prover too weak. 3324 trivial. 0 not checked. [2025-02-05 21:37:56,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:37:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 153 proven. 21 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-02-05 21:37:56,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283355346] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:37:56,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:37:56,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 19 [2025-02-05 21:37:56,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721172589] [2025-02-05 21:37:56,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:37:56,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 21:37:56,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:56,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 21:37:56,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-02-05 21:37:56,719 INFO L87 Difference]: Start difference. First operand 22725 states and 39171 transitions. Second operand has 19 states, 18 states have (on average 13.833333333333334) internal successors, (249), 18 states have internal predecessors, (249), 9 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (177), 9 states have call predecessors, (177), 9 states have call successors, (177) [2025-02-05 21:38:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:08,071 INFO L93 Difference]: Finished difference Result 142580 states and 243303 transitions. [2025-02-05 21:38:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-05 21:38:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 13.833333333333334) internal successors, (249), 18 states have internal predecessors, (249), 9 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (177), 9 states have call predecessors, (177), 9 states have call successors, (177) Word has length 385 [2025-02-05 21:38:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:08,354 INFO L225 Difference]: With dead ends: 142580 [2025-02-05 21:38:08,354 INFO L226 Difference]: Without dead ends: 121296 [2025-02-05 21:38:08,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=790, Invalid=2402, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 21:38:08,400 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 2854 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2984 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:08,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2984 Valid, 3537 Invalid, 4098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 3405 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 21:38:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121296 states. [2025-02-05 21:38:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121296 to 35257. [2025-02-05 21:38:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35257 states, 31964 states have (on average 1.6858340633212363) internal successors, (53886), 32104 states have internal predecessors, (53886), 3055 states have call successors, (3055), 237 states have call predecessors, (3055), 237 states have return successors, (3055), 2915 states have call predecessors, (3055), 3055 states have call successors, (3055) [2025-02-05 21:38:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35257 states to 35257 states and 59996 transitions. [2025-02-05 21:38:10,985 INFO L78 Accepts]: Start accepts. Automaton has 35257 states and 59996 transitions. Word has length 385 [2025-02-05 21:38:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:10,985 INFO L471 AbstractCegarLoop]: Abstraction has 35257 states and 59996 transitions. [2025-02-05 21:38:10,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 13.833333333333334) internal successors, (249), 18 states have internal predecessors, (249), 9 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (177), 9 states have call predecessors, (177), 9 states have call successors, (177) [2025-02-05 21:38:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 35257 states and 59996 transitions. [2025-02-05 21:38:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-05 21:38:10,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:10,995 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:38:11,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:38:11,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:38:11,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash 21268877, now seen corresponding path program 1 times [2025-02-05 21:38:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:11,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268301981] [2025-02-05 21:38:11,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:11,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-05 21:38:11,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-05 21:38:11,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:11,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-05 21:38:33,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:33,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268301981] [2025-02-05 21:38:33,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268301981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:33,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:33,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 21:38:33,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196845525] [2025-02-05 21:38:33,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:33,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 21:38:33,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:33,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 21:38:33,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-02-05 21:38:33,137 INFO L87 Difference]: Start difference. First operand 35257 states and 59996 transitions. Second operand has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 4 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59)